Generalized Network Psychometrics: Combining Network and Latent Variable Models
نویسندگان
چکیده
منابع مشابه
Properties of latent variable network models
We derive properties of Latent Variable Models for networks, a broad class of models that includes the widely-used Latent Position Models. These include the average degree distribution, clustering coefficient, average path length and degree correlations. We introduce the Gaussian Latent Position Model, and derive analytic expressions and asymptotic approximations for its network properties. We ...
متن کاملGeneralized Latent Factor Models for Social Network Analysis
Homophily and stochastic equivalence are two primary features of interest in social networks. Recently, the multiplicative latent factor model (MLFM) is proposed to model social networks with directed links. Although MLFM can capture stochastic equivalence, it cannot model well homophily in networks. However, many real-world networks exhibit homophily or both homophily and stochastic equivalenc...
متن کاملEstimation of Generalized Linear Latent Variable Models
Generalized Linear Latent Variable Models (GLLVM), as de ned in Bartholomew and Knott (1999) enable modelling of relationships between manifest and latent variables. They extend structural equation modelling techniques, which are powerful tools in the social sciences. However, because of the complexity of the log-likelihood function of a GLLVM, an approximation such as numerical integration mus...
متن کاملLatent variable time-varying network inference
In many applications of finance, biology and sociology, complex systems involve entities interacting with each other. These processes have the peculiarity of evolving over time and of comprising latent factors, which influence the system without being explicitly measured. In this work we present latent variable time-varying graphical lasso (LTGL), a method for multivariate time-series graphical...
متن کاملCombining Probabilistic Search, Latent Variable Analysis and Classification Models
The EM and1 K-Means algorithms are two popular search techniques that converge to a local minimum of their respective loss functions. The EM algorithm uses partial assignment of instances while the K-Means algorithm uses exclusive assignment. We show that an exclusive random assignment (ERA) algorithm that performs exclusive assignment based on a random experiment can outperform both EM and K-M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychometrika
سال: 2017
ISSN: 0033-3123,1860-0980
DOI: 10.1007/s11336-017-9557-x